Source routing and scheduling in packet networks

Routing and Scheduling in Packet Radio Networks

A New approach for channel assignment in packet radio networks is presented. To arrive at this: 1) we show the difficulty with traditional graph coloring method for link scheduling. 2) An algorithm for generating maximal independent sets of links is presented. 3) Importance of combined routing and scheduling is shown and an LP problem is formulated for combined routing and scheduling.

Packet routing and scheduling

Routing and Scheduling File Transfers in Packet-switched Networks

Data traac in networks has always been dominated by le transfers, an observation that has motivated previous work in scheduling le transfers. While these previous research contributions address le transfers, they do not address the special considerations required of packet-switched networks, in particular the issues of routing and of simultaneous transmissions of les. In this paper, we generali...

Routing and Scheduling File Transfers in Packet-switched Networks | Appendix

THEOREM 1 If G F and G N are both bipartite, les have arbitrary lengths and links have unit speeds, then GFTS1 is NP-complete. Proof This can be proved by a simple reduction from the NP-complete Multiproces-sor Scheduling (MS) problem. In MS, we are given m 2 identical processors, and n independent jobs of lengths p 1 ; p 2 See Figure 3. It is easy to prove that there is a nonpreemptive multipr...

Low-energy Mobile Packet Radio Networks: Routing, Scheduling, and Architecture

Packet Radio Networks (PRNETs), which are also called ad-hoc networks, have the capability of fast (and ad-hoc) deployment and set-up, and therefore potentially have several useful civilian and military applications. Building low-energy PRNETs is an important design goal, because the communication devices are typically powered by batteries, and therefore are useless when the batteries are deple...